Optimizing real world applications with GCC Link Time Optimization

نویسندگان

  • T. Glek
  • Jan Hubicka
چکیده

GCC has a new infrastructure to support a link time optimization (LTO). The infrastructure is designed to allow linking of large applications using a special mode (WHOPR) which support parallelization of the compilation process. In this paper we present overview of the design and implementation of WHOPR and present test results of its behavior when optimizing large applications. We give numbers on compile time, memory usage and code quality comparisons to the classical file by file based optimization model. In particular we focus on Firefox web browser. We show main problems seen only when compiling a large application, such as startup time and code size growth.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing large applications

Both uppermost open source compilers, GCC and LLVM, are mature enough to link-time optimize large applications. In case of large applications, we must take into account, except standard speed efficiency and memory consumption, different aspects. We focus on size of the code, cold start-up time, etc. Developers of applications often come up with ad-hoc solutions such as Elfhack utility, start-up...

متن کامل

Direct adaptive fuzzy control of flexible-joint robots including actuator dynamics using particle swarm optimization

In this paper a novel direct adaptive fuzzy system is proposed to control flexible-joints robot including actuator dynamics. The design includes two interior loops: the inner loop controls the motor position using proposed approach while the outer loop controls the joint angle of the robot using a PID control law. One novelty of this paper is the use of a PSO algorithm for optimizing the contro...

متن کامل

Optimizing for Space : Measurements and Possibilities for Improvement

GCC’s optimization for space seems to have been often neglected, in favor of performance tuning. With this work we aim at determining the weakpoints of GCC concerning its optimization capability for space. We compare (1) GCC with two nonfree ARM cross-compiler toolchains, (2) how GCC evolved from release 3.2.2 to version 3.3, and (3) two runtime libraries for the Linux kernel. All tests were pe...

متن کامل

Dynamic Optimization Option Search in GCC

A set of carefully selected compiler optimization options could provide an additional performance boost over the current best default optimization options in the GNU Compiler Collection (GCC) C compiler. However, there are more than 60 optimization options in GCC compiler, which translate to over 260 possible combinations. GCC compiler developers are therefore faced with a challenge. The goal i...

متن کامل

MILEPOST GCC: machine learning based research compiler

Tuning hardwired compiler optimizations for rapidly evolving hardware makes porting an optimizing compiler for each new platform extremely challenging. Our radical approach is to develop a modular, extensible, self-optimizing compiler that automatically learns the best optimization heuristics based on the behavior of the platform. In this paper we describe MILEPOST1 GCC, a machine-learning-base...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1010.2196  شماره 

صفحات  -

تاریخ انتشار 2010